SIMD-based Implementations of Eta Pairing Over Finite Fields of Small Characteristics
نویسندگان
چکیده
Eta pairing on supersingular elliptic curves defined over fields of characteristics two and three is a popular and practical variant of pairing used in many cryptographic protocols. In this paper, we study SIMD-based implementations of eta pairing over these fields. Our implementations use standard SIMD-based vectorization techniques which we call horizontal and vertical vectorization. To the best of our knowledge, we are the first to study vertical vectorization in the context of curves over fields of small characteristics. Our experimentation using SSE2 intrinsics reveals that vertical vectorization outperforms horizontal vectorization.
منابع مشابه
GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field
Eta pairing on a supersingular elliptic curve over the binary field F21223 used to offer 128-bit security, and has been studied extensively for efficient implementations. In this paper, we report our GPUbased implementations of this algorithm on an NVIDIA Tesla C2050 platform. We propose efficient parallel implementation strategies for multiplication, square, square root and inverse in the unde...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملSide Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings. However, the research for secure implementations of the pairings ha...
متن کاملEfficient Countermeasure for Securing the Eta Pairing Computation over Binary Fields
Pairing based cryptosystems have became suitable for use on constrained devices with small resources. Recently, It has shown that side channel attacks are a serious threat for such cryptographic applications. In order to secure the pairing based cryptosystems against the side channel attacks, many countermeasures have been proposed but their cost is proved to be highly expensive. In this paper,...
متن کاملHydra: An Energy-Efficient Programmable Cryptographic Coprocessor Supporting Elliptic-Curve Pairings over Fields of Large Characteristics
Bilinear pairings on elliptic curves have many applications in cryptography and cryptanalysis. Pairing computation is more complicated compared to that of other popular public-key cryptosystems. Efficient implementation of cryptographic pairing, both softwareand hardware-based approaches, has thus received increasing interest. In this paper, we focus on hardware implementation and present the d...
متن کامل